Concise Planning and Filtering: Hardness and Algorithms
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms, and Hardness
Genetic algorithm (GA) researchers have long desired to describe the key characteristics of GA-hardness. Unfortunately this goal has remained largely unmet. In this paper, we describe a new way for evaluating GA-hardness that is based on the foundations of formal complexity theory. In particular, a GA-reduction is introduced. Using this reduction, we show that a reasonable definition of "GA-har...
متن کاملHardness study and selection algorithms
Horizontal Partitioning has been largely adopted by the database community, where it took a significant part in the physical design process. Actually, it is supported by most commercial database systems (DBMS), where a native Data Definition Language for decomposing tables/materialized views using various modes is proposed. In traditional databases, horizontal partitioning has been largely stud...
متن کاملApproximation Algorithms and Hardness of Approximation
S (in alphabetic order by speaker surname) Speaker: Hyung-Chan An (EPFL, Lausanne) Title: LP-Based Algorithms for Capacitated Facility Location Abstract: Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algori...
متن کاملHardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In the first result of this paper we prove that computing rc(G) is NP-Hard solving an open problem from [6]. In fact, we prov...
متن کاملApproximation algorithms and the hardness of approximation
Chandra Chekuri (Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL), Joseph Cheriyan (Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, ON), Ryan O’Donnell (School of Computer Science, Carnegie Mellon University, Pittsburgh, PA), Mohammad R. Salavatipour (Dept. of Computing Science, University of Alberta, Edmonton, AL), David Williamson (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automation Science and Engineering
سال: 2017
ISSN: 1545-5955,1558-3783
DOI: 10.1109/tase.2017.2701648